Chromatic number is Ramsey distinguishing
نویسندگان
چکیده
A graph $G$ is Ramsey for a $H$ if every colouring of the edges in two colours contains monochromatic copy $H$. Two graphs $H_1$ and $H_2$ are equivalent any only it $H_2$. parameter $s$ distinguishing $s(H_1)\neq s(H_2)$ implies that not equivalent. In this paper we show chromatic number parameter. We also extend to multi-colour case use similar idea find another which distinguishing.
منابع مشابه
Circular Chromatic Ramsey Number
Let χc(H) denote the circular chromatic number of a graph H. For graphs F and G, the circular chromatic Ramsey number Rχc(F,G) is the infimum of χc(H) over graphs H such that every red/blue edge-coloring of H contains a red copy of F or a blue copy of G. We characterize Rχc(F,G) in terms of a Ramsey problem for the families of homomorphic images of F and G. Letting zk = 3 − 2 −k, we prove that ...
متن کاملDistinguishing Edge Chromatic Number
An adjacent vertex distinguishing edge-coloring or an avd-coloring of a simple graph G is a proper edge-coloring of G such that no pair of adjacent vertices meets the same set of colors. We prove that every graph with maximum degree ∆ and with no isolated edges has an avd-coloring with at most ∆ + 300 colors, provided that ∆ > 1020. AMS Subject Classification: 05C15
متن کاملThe Distinguishing Chromatic Number
In this paper we define and study the distinguishing chromatic number, χD(G), of a graph G, building on the work of Albertson and Collins who studied the distinguishing number. We find χD(G) for various families of graphs and characterize those graphs with χD(G) = |V (G)|, and those trees with the maximum chromatic distingushing number for trees. We prove analogs of Brooks’ Theorem for both the...
متن کاملThe chromatic Ramsey number of odd wheels
We prove that the chromatic Ramsey number of every odd wheel W2k+1, k ≥ 2 is 14. That is, for every odd wheel W2k+1, there exists a 14-chromatic graph F such that when the edges of F are two-coloured, there is a monochromatic copy of W2k+1 in F , and no graph F with chromatic number 13 has the same property. We ask whether a natural extension of odd wheels to the family of generalized Mycielski...
متن کاملLarge Chromatic Number and Ramsey Graphs
Let Q(n, χ) denote the minimum clique size an n-vertex graph can have if its chromatic number is χ . Using Ramsey graphs we give an exact, albeit implicit, formula for the case χ ≥ (n + 3)/2.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2021
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22731